Перевод: с английского на русский

с русского на английский

point-symmetric graph

См. также в других словарях:

  • Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

  • Symmetric group — Not to be confused with Symmetry group. A Cayley graph of the symmetric group S4 …   Wikipedia

  • Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …   Wikipedia

  • Möbius–Kantor graph — Named after August Ferdinand Möbius and S. Kantor Vertices 16 …   Wikipedia

  • Nauru graph — The Nauru graph is Hamiltonian. Vertices 24 Edges 36 Radius 4 …   Wikipedia

  • Desargues graph — Named after Gérard Desargues Vertices 20 Edges 30 …   Wikipedia

  • Gray graph — infobox graph name = Gray graph image caption = namesake = Marion Cameron Gray vertices = 54 edges = 81 girth = 8 chromatic number = 2 chromatic index = 3 properties = Cubic Semi symmetricIn mathematics, the Gray graph is an undirected bipartite… …   Wikipedia

  • Rado graph — The Rado graph, as numbered by Rado (1964). In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G… …   Wikipedia

  • Geometric graph theory — In mathematics, a geometric graph is a graph in which the vertices or edges are associated with geometric objects or configurations. Geometric graph theory is a specialization of graph theory that studies geometric graphs. Notable geometric… …   Wikipedia

  • Bidirected graph — In the mathematical domain of graph theory, a bidirected graph (introduced by harvnb|Edmonds|Johnson|1970) is a graph in which each edge is given an independent orientation (or direction, or arrow) at each end. Thus, there are three kinds of… …   Wikipedia

  • Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»